Attributing a Probability to the Shape of a Probability Density
نویسندگان
چکیده
We discuss properties of two methods for ascribing probabilities to the shape of a probability distribution. One is based on the idea of counting the number of modes of a bootstrap version of a standard kernel density estimator. We argue that the simplest form of that method suffers from the same difficulties that inhibit level accuracy of Silverman’s bandwidth-based test for modality: the conditional distribution of the bootstrap form of a density estimator is not a good approximation to the actual distribution of the estimator. This difficulty is less pronounced if the density estimator is oversmoothed, but the problem of selecting the extent of oversmoothing is inherently difficult. It is shown that the optimal bandwidth, in the sense of producing optimally high sensitivity, depends on the widths of putative bumps in the unknown density and is exactly as difficult to determine as those bumps are to detect. We also develop a second approach to ascribing a probability to shape, using Müller and Sawitzki’s notion of excess mass. In contrast to the context just discussed, it is shown that the bootstrap distribution of empirical excess mass is a relatively good approximation to its true distribution. This leads to empirical approximations to the likelihoods of different levels of “modal sharpness,” or “delineation,” of modes of a density. The technique is illustrated numerically.
منابع مشابه
Fractional Probability Measure and Its Properties
Based on recent studies by Guy Jumarie [1] which defines probability density of fractional order and fractional moments by using fractional calculus (fractional derivatives and fractional integration), this study expands the concept of probability density of fractional order by defining the fractional probability measure, which leads to a fractional probability theory parallel to the classical ...
متن کاملA continuous approximation fitting to the discrete distributions using ODE
The probability density functions fitting to the discrete probability functions has always been needed, and very important. This paper is fitting the continuous curves which are probability density functions to the binomial probability functions, negative binomial geometrics, poisson and hypergeometric. The main key in these fittings is the use of the derivative concept and common differential ...
متن کاملA new probability density function in earthquake occurrences
Although knowing the time of the occurrence of the earthquakes is vital and helpful, unfortunately it is still unpredictable. By the way there is an urgent need to find a method to foresee this catastrophic event. There are a lot of methods for forecasting the time of earthquake occurrence. Another method for predicting that is to know probability density function of time interval between earth...
متن کاملتخمین احتمال بزرگی زمینلغزشهای رخداده در حوزه آبخیز پیوهژن (استان خراسان رضوی)
Knowing the number, area, and frequency of landslides occurred in each area has a prominent role in the long-term evolution of area dominated by landslides and can be used for analyzing of susceptibility, hazard, and risk. In this regard, the current research is trying to consider identified landslides size probability in the Pivejan Watershed, Razavi Khorasan Province. In the first step, lands...
متن کاملUnscented Auxiliary Particle Filter Implementation of the Cardinalized Probability Hypothesis Density Filters
The probability hypothesis density (PHD) filter suffers from lack of precise estimation of the expected number of targets. The Cardinalized PHD (CPHD) recursion, as a generalization of the PHD recursion, remedies this flaw and simultaneously propagates the intensity function and the posterior cardinality distribution. While there are a few new approaches to enhance the Sequential Monte Carlo (S...
متن کاملفشرده سازی اطلاعات متغیر با زمان با استفاده از کد هافمن
Abstract: In this paper, we fit a function on probability density curve representing an information stream using artificial neural network . This methodology result is a specific function which represent a memorize able probability density curve . we then use the resulting function for information compression by Huffman algorithm . the difference between the proposed me then with the general me...
متن کامل